An algorithm to compute a T-transitive opening of a proximity
نویسندگان
چکیده
There are fast known algorithms to compute the transitive closure of a fuzzy relation, but there are only a few different algorithms that compute T-transitive low approximations of a fuzzy relation. A fast method to compute a T-transitive low approximation of a reflexive and symmetric fuzzy relation is given for any continuous tnorm, spending O(n) time.
منابع مشابه
An Algorithm to Compute the Transitive Closure, a Transitive Approximation and a Transitive Opening of a Fuzzy Proximity
A method to compute the transitive closure, a transitive opening and a transitive approximation of a reflexive and symmetric fuzzy relation is given. Other previous methods in literature compute just the transitive closure, some transitive approximations or some transitive openings. The proposed algorithm computes the three different similarities that approximate a proximity for the computation...
متن کاملA T-transitive opening of a proximity
A fast method to compute a T-transitive opening of a proximity is given for any tnorm, spending O(n) time. Even though there is not a unique T-transitive approximation of a fuzzy relation, it is proved that the computed T-transitive opening is maximal.
متن کاملAn Algorithm to Compute the Transitive Closure, a Transitive Approximation and a Transitive Opening of a Proximity*
Equivalence relations are important in many branches of knowledge and especially in Classification theories and Cluster Analysis since they generate a partition on the universe of discourse and permit to classify their elements and make clusters. In many cases the relation we start with is not an equivalence relation but only a reflexive and symmetric one. A very important family of fuzzy relat...
متن کاملClustering Methods Based on Weighted Quasi-Arithmetic Means of T-Transitive Fuzzy Relations
In this paper we propose clustering methods based on weighted quasiarithmetic means of T -transitive fuzzy relations. We first generate a T -transitive closure R from a proximity relation R based on a max-T composition and produce a T -transitive lower approximation or opening RT from the proximity relation R through the residuation operator. We then aggregate a new T -indistinguishability fuzz...
متن کاملComputing a T-transitive lower approximation or opening of a proximity relation
Since transitivity is quite often violated even by decisión makers that accept transitivity in their preferences as a condition for consistency, a standard approach to deal with intransitive preference elicitations is the search for a cióse enough transitive preference relation, assuming that such a violation is mainly due to decisión maker estimation errors. In some way, the more number of eli...
متن کامل